Calculating read operations and filtering redundant read requests in a storage system

ABSTRACT

Read messages are issued by a client for data stored in a storage system of the networked client-server architecture. A client agent mediates between the client and the storage system. Each sequence of read requests generated by a single thread of execution in the client to read a specific data segment in the storage is defined as a client read session. The client agent maintains a read-ahead cache for each client read session and generates read-ahead requests to load data into the read-ahead cache. Each read request and read-ahead request sent from the client agent to the storage system includes positions and a size for reading and a sequence id value. The storage system filters and modifies incoming read request and read-ahead requests based on sequence ID values, positions and sizes of the incoming read request and read-ahead requests.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a Continuation of U.S. patent application Ser. No.12/958,196, filed on Dec. 1, 2010.

FIELD OF THE INVENTION

The present invention relates in general to computers, and moreparticularly to apparatus, method and computer program productembodiments for calculating a read operation and filtering redundantread requests in a storage system in a computing environment.

DESCRIPTION OF THE RELATED ART

When performing sequential read operations, a read-ahead mechanismimproves the efficiency of the reading process by performing backgroundread-ahead operations, which load data from a storage device into amemory based cache, and this data is then read directly from the cachein subsequent read operations. This enables to efficiently utilize thestorage channels and devices, balance I/O access over time, and thusincrease the efficiency of the overall read process. Specifically, whenprocessing a read operation, rather than waiting for the data to beretrieved from the storage device, the data is generally alreadyavailable in the read-ahead cache, and since cache access (which iscommonly memory based) is faster than I/O access, the entire readprocess is more efficient.

SUMMARY OF THE INVENTION

A read-ahead mechanism is generally optimized for a sequential read usecase. In the architecture considered in the following illustratedembodiments and claimed subject matter, several factors may reduce theefficiency of a read-ahead mechanism. Primarily, since it is assumedthat messages may be reordered when passing through the network,messages may be received at the destination in a different orderrelative to that by which they were generated and sent. This may causeread and read-ahead messages issued sequentially by a client to appearnon-sequential when received by a storage system. Specifically, thesemessages may appear to have gaps and read-behind behavior. Both of thesebehaviors may reduce the efficiency of a read-ahead mechanism operatingin the storage system, since it is more difficult in such a situation todetermine which data is most beneficial to reside in the read-aheadcache of the storage system.

In addition, as the client application moves from reading one storagesegment to another, read-ahead messages issued by the client forprevious segments may reach the storage system after read and read-aheadmessages associated with the next segments have already been processedby the storage system. Processing the obsolete messages associated withthe previous segments would be inefficient, since such processingconsumes resources. Furthermore, processing such obsolete messages maydivert the read-ahead mechanism operating in the storage system, to theprevious segments, which also reduces the efficiency of the readingprocess.

In view of the foregoing, a need exists for mechanisms to address theabove challenges. Accordingly, various embodiments for read-aheadprocessing in a networked client-server architecture by a processordevice are provided. Read messages are grouped by a plurality of uniquesequence identifications (IDs), where each of the sequence IDscorresponds to a specific read sequence, consisting of all read andread-ahead requests related to a specific storage segment that is beingread sequentially by a thread of execution in a client application. Thestorage system uses the sequence id value in order to identify andfilter read-ahead messages which are obsolete when received by thestorage system, as the client application has already moved to read adifferent storage segment. Basically, a message is discarded when itssequence id value is less recent than the most recent value already seenby the storage system. The sequence IDs are used by the storage systemto determine corresponding read-ahead data to be loaded into aread-ahead cache maintained by the storage system for each clientapplication read session, wherein the read-ahead cache is logicallypartitioned into preceding and following logically sequential buffersfor data processing. When advancing the data contents of the read-aheadcache, according to the way in which the read requests of the clientapplication read session advance, the data is loaded into the followinglogical buffer beginning at an offset one byte after the end offset ofthe preceding logical buffer. As long as a sequential reading stream ismaintained by a client application read session, which is deduced byobserving the incoming and the maintained values of the sequence ID,then the read-ahead cache location in the data segment being read isadvanced using the method broadly described above, and read requests areeither processed from the contents of the cache, or retrieved from thestorage device (if the data they reference is not fully contained in thecache). When a new sequential reading stream is identified, againdeduced by observing the incoming and the maintained values of thesequence ID, then the cache's location in the data segment being read ismodified based on the incoming read request's offset, and the requesteddata is provided from the cache.

Moreover, various embodiments are provided for filtering obsoleterequests and read requests by a processor device in a computingenvironment. Read messages are issued by a client for data stored in astorage system of the networked client-server architecture. A clientagent mediates between the client and the storage system. Each sequenceof read requests generated by a single thread of execution in the clientto read a specific data segment in the storage is defined as a clientread session. The client agent maintains a read-ahead cache for eachclient read session and generates read-ahead requests to load data intothe read-ahead cache. Each read request and read-ahead request sent fromthe client agent to the storage system includes positions and a size forreading and a sequence id value. The storage system filters and modifiesincoming read request and read-ahead requests based on sequence IDvalues, positions and sizes of the incoming read request and read-aheadrequests.

BRIEF DESCRIPTION OF THE DRAWINGS

In order that the advantages of the invention will be readilyunderstood, a more particular description of the invention brieflydescribed above will be rendered by reference to specific embodimentsthat are illustrated in the appended drawings. Understanding that thesedrawings depict embodiments of the invention and are not therefore to beconsidered to be limiting of its scope, the invention will be describedand explained with additional specificity and detail through the use ofthe accompanying drawings, in which:

FIG. 1 illustrates an exemplary read-ahead architecture in a computingstorage environment;

FIG. 2 illustrates gaps in a sequential read flow;

FIG. 3 illustrates an exemplary method for processing read requestsconsidering incoming and maintained sequence ID values;

FIG. 4 illustrates an exemplary method for processing read requestsconsidering incoming and maintained sequence ID values, and farthestoffset values;

FIG. 5 illustrates exemplary computation of an updated data range of aread request using a farthest offset;

FIGS. 6 and 7 illustrate an exemplary layout of logical buffers in aphysical buffer implemented as a read-ahead cache;

FIG. 8 illustrates an exemplary condition for triggering an advancementof data contents of the logical buffers first depicted in FIG. 6, basedon predefined thresholds;

FIG. 9 illustrates an exemplary method for processing an incoming readrequest using a cache buffer; and

FIG. 10 illustrates exemplary hardware adapted for implementing aspectsof the following claimed subject matter.

DETAILED DESCRIPTION OF THE DRAWINGS

In the following illustrated embodiments, networked client-serverarchitecture is considered, where a client application issues readrequests for data stored in a storage system (which is the server inthis architecture). The client application and the storage system areattached via network. FIG. 1 illustrates exemplary such networkedclient-server architecture 10. A client system 12 houses a clientapplication 14, in which read requests are issued via a client agent 20,which resides locally relative to the client application (i.e. on thesame processor), and employs a read-ahead cache 18. The client agent 20is the agent of the storage system 26 on the processor running theclient application 14. The client agent 20 (rather than the clientapplication) communicates over the network 28 with the storage system26.

The client agent 20 and the storage system 26 communicate using messages(e.g., read and read-ahead requests 22) over the network 28. As commonto assume with regard to networks, it is assumed in this architecturethat messages 22 may be reordered when passing through the networkrelative to their generation order. In architecture 10, both the clientagent 20 and the storage system 26 may apply their own read-aheadmechanisms. Namely, the client agent 20 may produce read-aheadoperations, based on the read requests issued by the client application20, and store the read-ahead data in its own cache 18. Also, the storagesystem 26 may generate read-ahead operations, based on the read requests22 received from the client agent 20, and store the read-ahead data in adedicated cache 24. The storage system 26 utilizes storage networkconnectivity 30 to send read and read-ahead requests 32 to the storagedevice 32 as shown.

Although the read requests issued by the client application 14 aregenerally sequential by assumption (hence the benefit of the read-aheadmechanism in this context), the high level read pattern of the clientapplication is assumed to be random. An example of such a read patternwould be an application that reads relatively large data sections, usingsequential read operations of smaller sub-sections, from multiplestorage entities (e.g. files), each independently stored in the storagesystem.

As previously mentioned, a read-ahead mechanism is generally optimizedfor a sequential read use case. In the architecture 10 considered in theillustrated embodiments, several factors may reduce the efficiency of aread-ahead mechanism. Primarily, since it is assumed that messages maybe reordered when passing through the network, messages may be receivedat the destination in a different order relative to that by which theywere generated and sent. This may cause read and read-ahead messagesissued sequentially by the client agent to appear non-sequential whenreceived by the storage system. Specifically, these messages may appearto have gaps and read-behind behavior. Both of these behaviors mayreduce the efficiency of a read-ahead mechanism operating in the storagesystem, since it is more difficult in such a situation to determinewhich data is most beneficial to reside in the read-ahead cache of thestorage system.

In addition, and again as previously mentioned, as the clientapplication moves from reading one storage segment to another,read-ahead messages issued by the client agent for previous segments mayreach the storage system after read and read-ahead messages associatedwith the next segments have already been processed by the storagesystem. Processing the obsolete messages associated with the previoussegments would be inefficient, since such processing consumes resources.Furthermore, processing such obsolete messages may divert the read-aheadmechanism operating in the storage system, to the previous segments,which also reduces the efficiency of the reading process.

The illustrated embodiments, following, serve to efficiently address theabove challenges. In the mechanisms of the illustrated embodiments, eachread and read-ahead message sent from the client agent to the storagesystem conveys what will be referred to herein as a sequence id value,which groups read messages in a specific read sequence, such that allread and read-ahead requests which are related to a specific storagesegment that is being read sequentially by a thread of execution in theclient application are assigned with the same unique sequence id value,and are thus grouped together. The storage system uses the sequence idvalue in order to identify and filter read-ahead messages that areobsolete when received by the storage system, as the client applicationhas already moved to read a different storage segment. Broadly, amessage is discarded when its sequence id value is less recent than themost recent value already seen by the storage system.

In case the client agent's implementation of its read-ahead mechanisminvolves generating in each iteration a read-ahead request covering allthe data required for loading into its read-ahead cache, while notconsidering previously issued read-ahead requests or responses toread-ahead requests which are currently being generated or sent, themechanisms of the illustrated embodiments enable the storage system toefficiently process such read-ahead requests. Such an approach taken forthe implementation of the client agent simplifies its implementation,and eventually enables the storage system to ensure that read accessesapplied to the storage devices via its read-ahead mechanisms arepractically serialized in terms of their offsets, thus enhancing theeffectiveness of the read-ahead mechanisms used by the storage system.In this approach the read-ahead requests generated by the client agentmay overlap in their data ranges, which in turn requires the storagesystem to filter and modify read requests also based on their requesteddata ranges.

Throughout the following description, a read session associated with athread of execution in the client application is referred to as a clientapplication read session. Pursuant to the mechanisms of the illustratedembodiments, the storage system maintains for each client applicationread session, the current farthest offset it has processed in the datasegment being read (in addition to the maintained sequence id value).Generally, an incoming message is discarded by the storage system if thesequence id value of the read request specified by the message equalsthe maintained sequence id value and the end offset of the received readrequest is smaller than or equal to the maintained farthest offset. Ifthe sequence id values are equal, and the end offset of the read requestis larger than the farthest offset, then the farthest offset is modifiedto be the end offset of the read request, and the data range to read andsend to the client agent is computed as the range starting from theprevious value of the farthest offset plus one byte and ending at thenew value of the farthest offset.

The storage system maintains a read-ahead cache for each clientapplication read session, and uses the incoming and the maintainedvalues of the sequence id to determine the data contents to be loadedinto the read-ahead cache. The physical buffer constituting theread-ahead cache is logically partitioned into two buffers, which arealways logically sequential in terms of their associated offsets in thedata. Each of the logical buffers, regardless of their layout in thephysical buffer, may be, in terms of their offsets in the data, thefirst logical buffer, and then the other buffer is the second logicalbuffer. The data content in the buffers is advanced according to the wayin which the read requests of the client application read sessionadvance. The data contents of the buffers can only move forward in thedata segment being read, and does not backtrack. Advancement istriggered by exceeding a threshold on the number of read requests whoseend offsets exceed a threshold offset in the second logical buffer,where the latter offset is defined based on a percentage of the datarange covered by the second logical buffer. Upon activation of suchadvancement, the start offset of the first logical buffer is set to bethe end offset of the second logical buffer plus one byte, and then datais loaded into the newly defined second logical buffer.

When processing an incoming read request, the data contents in both ofthe logical buffers is considered as a coherent data segment within asingle buffer. An incoming read request, in one embodiment, is processedusing the following method, as briefly described presently. As long as asequential reading stream is maintained by a client application readsession, which is deduced by observing the incoming and the maintainedvalues of the sequence id, then the buffer's location in the datasegment being read is modified only using the method broadly describedabove, and read requests are either processed from the contents of thebuffer, or retrieved from the storage device (if the data they referenceis not fully contained in the buffer). When a new sequential readingstream is identified, again deduced by observing the incoming and themaintained values of the sequence id, then the buffer's location in thedata segment being read is modified based on the incoming read request'soffset, and the requested data is provided from the buffer.

In the process of sending the data requested by a read operation to theclient agent, the storage system partitions the returned data intomultiple non-overlapping segments, and sends each segment in a separatenetwork message. The storage system sends these response messagesconcurrently by multiple threads of execution and using multiple networkconnections (i.e. each response message may be sent using a differentnetwork connection), thus balancing the response messages over networkconnections. Due to this method, utilization of the network bandwidthbetween the storage system and the client agent is significantlyimproved. The client agent collects the response messages sent by thestorage system, and forms the data of the read and read-ahead requestsfrom the data segments conveyed in the response messages. Since networkbandwidth is better utilized using the above method, the overall readperformance is increased.

Read-ahead messages generated by the client agent may become obsolete,when a client application read session moves to read a different storagesegment, and if these messages are received at the storage system aftermessages associated with the next segment were already processed by thestorage system. Pursuant to the mechanisms of the illustratedembodiments, such messages may be filtered at the storage system usingthe following methodology.

Each read and read-ahead message sent from the client agent to thestorage system conveys a sequence id value, which groups read messagesin a specific read sequence, such that all read and read-ahead requestswhich are related to a specific storage segment that is being readsequentially by a thread of execution in the client application areassigned with the same unique sequence id value, and are thus groupedtogether. There is an order relation among the sequence id values.Sequence id values are generated by the client agent independently foreach client application read session, and enable to determine thedifferent storage segments that are being read sequentially by thesession. Read and read-ahead requests are associated with a specificsequence id value, as long as the sequence id value is not modifiedbased on the client agent logic specified next.

In one embodiment, the client agent generates a new sequence id valuefor a client application read session in the following cases: (1) thereis no previous sequence id value for the session, or (2) a newsequential read flow is initiated by the session. A new sequential readflows may be, in one embodiment, identified by observing a gap in thecurrent read flow (either a forward gap or a backward gap), asexemplified in FIG. 2, following. Specifically, a gap exists when thedifference between the start offset of the new read request and the endoffset of the latest read request is different than one byte (thisdifference may be positive or negative). Observing a move of the readsession to read a different data entity in the storage (e.g. a differentindependent file), also identifies a new sequential read flow. Such anevent is identified by observing the session using a new identifier of astorage entity.

FIG. 2 depicts an exemplary range 50 in a particular data segment beingread to illustrate gaps in sequential read flow. The data range of thenext read request is exemplified to be either preceding 54 or following60 the data range of the latest read request 56. In the first case, theread requests create a backward gap 52, and in the second case, the readrequests create a forward gap 58.

Turning now to FIG. 3, an exemplary method 70 for processing readrequests by the storage system, applying read-ahead logic andconsidering the incoming and maintained sequence id values, isillustrated. For each client application read session, a currentsequence id value is maintained by the storage system. The currentsequence id value is initialized to a null value. For a newly receivedread request associated with a client application read session (step74): if there is no previous sequence id value for this session (step76), or if the received sequence id value is more recent than themaintained value (step 78), then the maintained value is set to be thevalue sent with the new read request (step 80), and the read request isfurther processed (step 82); if the received sequence id value equalsthe maintained value (again, step 78), then the maintained value is notchanged, and the read request is further processed (step 82); and if thereceived sequence id value is less recent than the maintained value(again, step 78), then the associated read request and its sequence idvalue are discarded (step 84). The method 70 then ends (step 86).

In one embodiment, the client agent maintains a read-ahead cache foreach client application read session to efficiently process readrequests issued by the session. The client agent generates read-aheadrequests to load data into its read-ahead cache. These requests aregenerated, and their responses from the storage system are processed, inan asynchronous (background) manner.

In a possible embodiment, the client agent records the farthest offsetup to which it has issued read-ahead requests, and generates additionalread-ahead requests from that offset further. In this embodiment, suchread-ahead requests will not overlap in their data ranges, and thus thestorage system processes the incoming read requests according to theirranges and does not have to filter or modify read requests due tooverlapping ranges.

In another alternative embodiment, the client agent generates, in eachiteration, a read-ahead request covering all the data required forloading into its read-ahead cache, while not considering previouslyissued read-ahead requests or responses to read-ahead requests that arecurrently being generated or sent. This approach simplifies the clientagent implementation, and results in read-ahead requests generated bythe client agent that may overlap in their data ranges. This requiresthe storage system to filter and modify incoming read requests alsobased on their requested data ranges. As a result of this processing,the storage system can ensure that read accesses applied to the storagedevices via its read-ahead mechanisms, are practically serialized interms of their offsets, thus enhancing the effectiveness of theread-ahead mechanisms used by the storage system. In this approach, thestorage system filters and modifies read requests using the followingmethodology as illustrated in FIG. 4, following.

FIG. 4 illustrates an exemplary method 90 for processing read requestsby the storage system considering incoming and maintained sequence IDvalues, and farthest offset values. The storage system maintains foreach client application read session, the current farthest offset it hasprocessed in the data segment being read. This value is initialized tonull. This value is maintained in addition to the maintained sequence IDvalue. For a new read request received from a client application readsession (step 94), if the sequence id value of the read request equalsthe maintained sequence id value (step 98) then: if the end offset ofthe read request is smaller than or equal to the farthest offset (step100), then the request is discarded (since the requested range wasalready processed and sent to the client agent) (step 108). If the endoffset of the read request is larger than the farthest offset (again,step 100), then the farthest offset is modified to be the end offset ofthe read request (step 102), and the data range to read and send to theclient agent is computed as the range starting from the previous valueof the farthest offset plus one byte and ending at the new value of thefarthest offset (step 104). This computation 120 is shown in FIG. 5,following, where, for an exemplary data range 122 of a read requesthaving a start offset 124 and an end offset 132, and a previous value ofthe farthest offset 126, result in an updated data range 128 of the readrequest ending at the new value of the farthest offset 130.

If the sequence id value of the read request is larger than themaintained sequence id value (again, step 98), or if there is noprevious sequence id value for this session (step 96), then themaintained sequence id value is set to be the value sent with the newread request (step 110), the farthest offset is set to be the end offsetof the new read request (step 112), and the read request is furtherprocessed, without any change to its range (step 106). If the sequenceid value of the read request is smaller than the maintained value(again, step 98), then the associated read request and its sequence idvalue are discarded (again, step 108). The method 90 then ends (step114).

In one embodiment, the storage system maintains a read-ahead cache foreach client application read session. The following is an exemplarymethodology for determining the data contents to be loaded into theread-ahead cache, and the usage of the cache to process read requests.The physical buffer constituting the read-ahead cache is logicallypartitioned into two buffers, whose data content is determined using thefollowing. The two buffers are always logically sequential, in terms oftheir associated offsets in the data. Namely, the start offset of thesecond logical buffer always starts one byte after the end offset of thefirst logical buffer. Each of the logical buffers, regardless of theirlayout in the physical buffer, may be, in terms of their offsets in thedata, the first logical buffer, and then the other buffer is the secondlogical buffer. This partitioning 140, 150 of an exemplary data segment148, 158 is illustrated in FIGS. 6 and 7, following, as Cases (A) and(B), respectively. The physical buffer 142, 152 is partitioned into afirst and second logical buffers 144, 146 and 154, 156 as shown.

At initiation, when both logical buffers are empty, and when the firstread request in a client application read session is processed, thefollowing exemplary methodology may be applied. The start offset of onebuffer (e.g. the buffer which is physically first in the physicalbuffer) is set to be the start offset of the read request. The startoffset of the other buffer is set to be the end offset of the firstbuffer plus one byte. The data size to be loaded into the buffers istheir total size (i.e. the size of the physical buffer). Data is loadedinto both buffers (generally with a single read operation to the storagedevice). The incoming read request is supplied from the buffers.

The data contents in the buffers may be advanced according to the way inwhich the read requests of the client application read session advance,using, for example the following methodology. Advancing the datacontents in the buffers is done by setting the start offset of the firstlogical buffer to be the end offset of the second logical buffer plusone byte. This switches between the first and the second logicalbuffers. Then data is loaded into the current second logical buffer(which was the previous first logical buffer).

The trigger for advancing the data contents of the buffers using theexemplary methodology specified above, is that the number of readrequests, whose end offsets exceed an offset threshold, exceeds athreshold of the number of such read requests. The offset threshold isrecomputed whenever the data contents of the logical buffers change(i.e. the first and the second logical buffers are switched), and itsvalue is correlated to a percentage of the data range covered by thesecond logical buffer. In our method this percentage is 50%, implyingthat when read requests start to refer to the second half of the secondlogical buffer, the data contents of the first logical buffer has lowprobability of being further accessed, and therefore the first logicalbuffer is advanced to become the second logical buffer. In oneembodiment, the threshold for the number of such read requests is two.These thresholds 166 and the condition (e.g., more than two readrequests 162 whose ending offsets exceed the offset threshold 164) fortriggering an advancement of the data contents of the buffers 168, 170,for an exemplary data segment 172 are illustrated in FIG. 8, following,as shown.

In the process of advancing the data contents of the buffers, theloading of data into the newly defined second logical buffer is done inan asynchronous (background) process relative to the processing of theread requests. If any read request has to access the data that is in theprocess of being loaded into the second logical buffer, then this readrequest is blocked (using a synchronization mechanism) until the data isloaded and available in the second logical buffer.

When processing an incoming read request, the data contents in both ofthe logical buffers is considered as a coherent data segment within asingle cache buffer. An incoming read request may, in one embodiment, beprocessed using the following method 180 shown in FIG. 9, following.Method 180 begins (step 182) with the receipt of a read request (step184). If the cache buffer is empty (step 186), data is loaded into bothlogical buffers using the methodology described previously (step 188),and the data for the read request is provided from the cache buffer(step 196).

If the cache buffer is not empty (again, step 186), and if the start andthe end offsets of the read request are within the cache buffer'soffsets (step 190), the data for the read request is provided from thecache buffer (again, step 196). If the sequence id of the read requestis larger than the current sequence id (step 192), then a flag is setindicating that upon the first subsequent read request that exceeds thecache buffer's range, the cache buffer will be reset (as specified inthe following). The current sequence id is set to be the sequence id ofthat read request (step 194). If the sequence id of the read request issmaller than the current sequence id (again, step 192), then that readrequest was already discarded by the sequence id screening describedpreviously.

If the cache buffer is not empty (again, step 186), and if the offsetsof the read request exceed the offsets of the cache buffer (again, step190), and if the sequence id of the read request equals the currentsequence id and the flag indicating a cache buffer reset is off(indicating that it is still the same sequential read stream) (step198), the data referenced by the read request is generally retrievedfrom the storage device, with the following exceptions. (1) If part ofthe data referenced by the read request exists in the cache buffer thenthis part may be provided from the cache buffer, and (2) if the currentread request has triggered a modification in the data contents of thecache buffer or if such a modification is already under way, and if itsreferenced data will exist in the modified data contents of the cachebuffer, then that read request may block until the cache buffer'supdated data contents is loaded (step 200). Implied in the above is thatread requests falling behind the data contents of the cache buffer areretrieved from the storage device (specifically their part not existingin the cache buffer is retrieved), and never wait for a modification inthe cache buffer's contents (which always advances forward).

If the sequence id of the read request is larger than the currentsequence id or the flag indicating a cache buffer reset is on(indicating that this is a new read stream) (step 198), the datacontents of the cache buffer is updated using the following methodology.The start offset of one logical buffer is set to be the start offset ofthe read request; the start offset of the other logical buffer is set tobe the end offset of the first logical buffer plus one byte; the sizefor reading into the buffers is their total size; and then data isloaded into the cache buffer (using a single read request to the storagedevice) (step 202). The flag indicating cache buffer reset is turned off(again, step 202). The read request is supplied from the cache buffer(step 196). Finally, if the sequence id of the read request is smallerthan the current sequence id, the message is filtered at reception byprior processing (described previously). The method 180 then ends (step204).

In the process of sending the data requested by a read operation to theclient agent, the storage system partitions the returned data intomultiple non-overlapping segments, and sends each segment in a separatenetwork message. The storage system sends these response messagesconcurrently by multiple threads of execution and using multiple networkconnections (i.e. each response message may be sent using a differentnetwork connection), thus balancing the response messages over networkconnections. As a result, utilization of the network bandwidth betweenthe storage system and the client agent is significantly improved. Theclient agent collects the response messages sent by the storage system,and forms the data of the read and read-ahead requests from the datasegments conveyed in the response messages. Since network bandwidth isbetter utilized using the above mechanisms, the overall read performanceis increased.

FIG. 10, following illustrates exemplary hardware 250 adapted forimplementing aspects of the following claimed subject matter. In thedepicted embodiment, an exemplary portion 252 of architecture 10(FIG. 1) is illustrated. Portion 252 of architecture 10 is operable in acomputer environment as a portion thereof, in which mechanisms of theforegoing illustrated embodiments may be implemented. It should beappreciated, however, that FIG. 10 is only exemplary and is not intendedto state or imply any limitation as to the particular architectures inwhich the exemplary aspects of the various embodiments may beimplemented. Many modifications to the architecture depicted in FIG. 10may be made without departing from the scope and spirit of the followingdescription and claimed subject matter.

Portion 252 includes a processor 254 and a memory 256, such as randomaccess memory (RAM). The portion 252 may be operatively coupled toseveral components not illustrated for purposes of convenience,including a display, which presents images such as windows to the useron a graphical user interface, a keyboard, mouse, printer, and the like.Of course, those skilled in the art will recognize that any combinationof the above components, or any number of different components,peripherals, and other devices, may be used with the portion 252.

In the illustrated embodiment, the portion 252 operates under control ofan operating system (OS) 258 (e.g. z/OS, OS/2, LINUX, UNIX, WINDOWS, MACOS) stored in the memory 256, and interfaces with the user to acceptinputs and commands and to present results. In one embodiment of thepresent invention, the OS 258 facilitates read-ahead functionalityaccording to the present invention. To this end, OS 258 includes aread-ahead module 264 which may be adapted for carrying out variousprocesses and mechanisms in the exemplary methods described in theforegoing illustrated embodiments.

Portion 252 may implement a compiler 262 that allows an applicationprogram 260 written in a programming language such as COBOL, PL/1, C,C++, JAVA, ADA, BASIC, VISUAL BASIC or any other programming language tobe translated into code that is readable by the processor 254. Aftercompletion, the application program 260 accesses and manipulates datastored in the memory 256 of the portion 252 using the relationships andlogic that was generated using the compiler 262.

In one embodiment, instructions implementing the operating system 258,the application program 260, and the compiler 262 are tangibly embodiedin a computer-readable medium, which may include one or more fixed orremovable data storage devices, such as a zip drive, disk, hard drive,DVD/CD-ROM, digital tape, solid state drives (SSDs), etc. Further, theoperating system 258 and the application program 260 may compriseinstructions which, when read and executed by the portion 252, cause theportion 252 to perform the steps necessary to implement and/or use thepresent invention. Application program 260 and/or operating system 258instructions may also be tangibly embodied in the memory 256. As such,the terms “article of manufacture,” “program storage device” and“computer program product” as may be used herein are intended toencompass a computer program accessible and/or operable from anycomputer readable device or media.

Embodiments of the present invention may include one or more associatedsoftware application programs 260 that include, for example, functionsfor managing a distributed computer system comprising a network ofcomputing devices, such as a storage area network (SAN). Accordingly,processor 254 may comprise one or more storage management processors(SMPs). The application program 260 may operate within a single computeror as part of a distributed computer system comprising a network ofcomputing devices. The network may encompass one or more computersconnected via a local area network and/or Internet connection (which maybe public or secure, e.g. through a virtual private network (VPN)connection), or via a fibre channel SAN or other known network types aswill be understood by those skilled in the art.

As will be appreciated by one skilled in the art, aspects of the presentinvention may be embodied as a system, method or computer programproduct. Accordingly, aspects of the present invention may take the formof an entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.) or anembodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, aspects of the present invention may take the form of acomputer program product embodied in one or more computer readablemedium(s) having computer readable program code embodied thereon.

Any combination of one or more computer readable medium(s) may beutilized. The computer readable medium may be a computer readable signalmedium or a computer readable storage medium. A computer readablestorage medium may be, for example, but not limited to, an electronic,magnetic, optical, electromagnetic, infrared, or semiconductor system,apparatus, or device, or any suitable combination of the foregoing. Morespecific examples (a non-exhaustive list) of the computer readablestorage medium would include the following: an electrical connectionhaving one or more wires, a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EPROM or Flash memory), an optical fiber,a portable compact disc read-only memory (CD-ROM), an optical storagedevice, a magnetic storage device, or any suitable combination of theforegoing. In the context of this document, a computer readable storagemedium may be any tangible medium that can contain, or store a programfor use by or in connection with an instruction execution system,apparatus, or device.

Program code embodied on a computer readable medium may be transmittedusing any appropriate medium, including but not limited to wireless,wired, optical fiber cable, RF, etc., or any suitable combination of theforegoing. Computer program code for carrying out operations for aspectsof the present invention may be written in any combination of one ormore programming languages, including an object oriented programminglanguage such as Java, Smalltalk, C++ or the like and conventionalprocedural programming languages, such as the “C” programming languageor similar programming languages. The program code may execute entirelyon the user's computer, partly on the user's computer, as a stand-alonesoftware package, partly on the user's computer and partly on a remotecomputer or entirely on the remote computer or server. In the latterscenario, the remote computer may be connected to the user's computerthrough any type of network, including a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

Aspects of the present invention have been described above withreference to flowchart illustrations and/or block diagrams of methods,apparatus (systems) and computer program products according toembodiments of the invention. It will be understood that each block ofthe flowchart illustrations and/or block diagrams, and combinations ofblocks in the flowchart illustrations and/or block diagrams, can beimplemented by computer program instructions. These computer programinstructions may be provided to a processor of a general purposecomputer, special purpose computer, or other programmable dataprocessing apparatus to produce a machine, such that the instructions,which execute via the processor of the computer or other programmabledata processing apparatus, create means for implementing thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

These computer program instructions may also be stored in a computerreadable medium that can direct a computer, other programmable dataprocessing apparatus, or other devices to function in a particularmanner, such that the instructions stored in the computer readablemedium produce an article of manufacture including instructions whichimplement the function/act specified in the flowchart and/or blockdiagram block or blocks. The computer program instructions may also beloaded onto a computer, other programmable data processing apparatus, orother devices to cause a series of operational steps to be performed onthe computer, other programmable apparatus or other devices to produce acomputer implemented process such that the instructions which execute onthe computer or other programmable apparatus provide processes forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks.

The flowchart and block diagrams in the above figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

While one or more embodiments of the present invention have beenillustrated in detail, the skilled artisan will appreciate thatmodifications and adaptations to those embodiments may be made withoutdeparting from the scope of the present invention as set forth in thefollowing claims.

What is claimed is:
 1. A method for calculating a read operation and filtering redundant read requests in a computing environment by a processor device, comprising: issuing read requests by a client for data stored in a storage system; mediating between the client and the storage system by a client agent; defining, as a client read session, each sequence of the read requests generated by a single thread of execution in the client to read a specific data segment in the storage system; maintaining a read-ahead cache for each client read session by the client agent; generating read-ahead requests by the client agent to load data into the read-ahead cache, wherein each of the read requests and the read-ahead requests sent from the client agent to the storage system includes a plurality of positions and sizes for reading and a sequence identification (ID) value; and filtering and modifying incoming read requests and the read-ahead requests by the storage system based on sequence ID values, the plurality of positions and the sizes of the incoming read requests and read-ahead requests.
 2. The method of claim 1, further including allowing for the client and the storage system to communicate in a network.
 3. The method of claim 2, further including: allowing the client agent to reside locally relative to a respective client of the client agent, and mediating between the client and the storage system by the client agent by communicating with the storage system using a plurality of messages over the network.
 4. The method of claim 3, further including reordering the plurality of messages while the plurality of messages are passing through the network relative to a generation order of the plurality of messages.
 5. The method of claim 1, further including performing one of: maintaining an order relation among the sequence ID values, and overlapping data positions and sizes of the read-ahead requests generated by the client agent.
 6. The method of claim 5, further including generating the sequence ID values by the client agent for each one of a plurality of client read sessions, wherein the sequence ID values generated for each one of the plurality of client read sessions are unique and each of the read requests and the read-ahead requests of a session are assigned the sequence ID value of a respective session.
 7. The method of claim 6, further including maintaining, for each one of a plurality of client read sessions by the storage system, a current farthest offset the storage system has processed in the data segment being read and a current sequence ID value.
 8. The method of claim 7, further including processing by the storage system the incoming read requests received from a client agent by performing one of: if the sequence ID value of a read request equals a maintained sequence ID value: discarding the read request if an end offset of the read request is one of smaller than and equal to the current farthest offset, and modifying the current farthest offset to be the end offset of the read request and calculating a data range to read and send to the client agent as the data range starting from a previous value of the current farthest offset plus one byte and ending at a new value of the current farthest offset if the end offset of the read request is larger than the current farthest offset, if one of the sequence ID values of the read request is larger than the maintained sequence ID value, and no previous sequence ID value of a current session exists: setting the maintained sequence ID value to be a value sent with an incoming read request and setting the current farthest offset to be the end offset of the incoming read request and continuing to process the read request without making any change to a range of the read request, and if the sequence ID value of the read request is smaller than the maintained sequence ID value: discarding the read request and the sequence ID value of the read request.
 9. A system for calculating a read operation and filtering redundant read requests in a computing environment, comprising: a storage system; a client in association with the storage system; a client agent in association with the storage system and the client; and at least one processor device, operable in the in the computing environment, in communication with the storage system, wherein the at least one processor device: issues read requests by the client for data stored in the storage system, mediates between the client and the storage system by the client agent, defines, as a client read session, each sequence of the read requests generated by a single thread of execution in the client to read a specific data segment in the storage system, maintains a read-ahead cache for each client read session by the client agent, generates read-ahead requests by the client agent to load data into the read-ahead cache, wherein each of the read requests and the read-ahead requests sent from the client agent to the storage system includes a plurality of positions and sizes for reading and a sequence identification (ID) value, and filters and modifies incoming read requests and the read-ahead requests by the storage system based on sequence ID values, the plurality of positions and the sizes of the incoming read requests and read-ahead requests.
 10. The system of claim 9, further including a network operable in the storage system, wherein the at least one processor device allows for the client and the storage system to communicate in the network.
 11. The system of claim 10, wherein the at least one processor device performs each of: allowing the client agent to reside locally relative to a respective client of the client agent, and mediating between the client and the storage system by the client agent by communicating with the storage system using a plurality of messages over the network.
 12. The system of claim 11, wherein the at least one processor device reorders the plurality of messages while the plurality of messages are passing through the network relative to a generation order of the plurality of messages.
 13. The system of claim 9, wherein the at least one processor device performs one of: maintaining an order relation among the sequence ID values, and overlapping data positions and sizes of the read-ahead requests generated by the client agent.
 14. The system of claim 13, wherein the at least one processor device generates the sequence ID values by the client agent for each one of a plurality of client read sessions, wherein the sequence ID values generated for each one of the plurality of client read sessions are unique and each of the read requests and the read-ahead requests of a session are assigned the sequence ID value of a respective session.
 15. The system of claim 14, wherein the at least one processor device maintains, for each one of a plurality of client read sessions by the storage system, a current farthest offset the storage system has processed in the data segment being read and a current sequence ID value.
 16. The system of claim 15, wherein the at least one processor device processes by the storage system the incoming read requests received from a client agent by performs one of: if the sequence ID value of a read request equals a maintained sequence ID value: discarding the read request if an end offset of the read request is one of smaller than and equal to the current farthest offset, and modifying the current farthest offset to be the end offset of the read request and calculating a data range to read and send to the client agent as the data range starting from a previous value of the current farthest offset plus one byte and ending at a new value of the current farthest offset if the end offset of the read request is larger than the current farthest offset, if one of the sequence ID values of the read request is larger than the maintained sequence ID value, and no previous sequence ID value of a current session exists: setting the maintained sequence ID value to be a value sent with an incoming read request and setting the current farthest offset to be the end offset of the incoming read request and continuing to process the read request without making any change to a range of the read request, and if the sequence ID value of the read request is smaller than the maintained sequence ID value: discarding the read request and the sequence ID value of the read request.
 17. A computer program product for calculating a read operation and filtering redundant read requests in a computing environment, the computer program product comprising a computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising: a first executable portion that issues read requests by a client for data stored in a storage system; a second executable portion that mediates between the client and the storage system by a client agent; a third executable portion that defining, as a client read session, each sequence of the read requests generated by a single thread of execution in the client to read a specific data segment in the storage system; a fourth executable portion that maintains a read-ahead cache for each client read session by the client agent; a fifth executable portion that generates read-ahead requests by the client agent to load data into the read-ahead cache, wherein each of the read requests and the read-ahead requests sent from the client agent to the storage system includes a plurality of positions and sizes for reading and a sequence identification (ID) value; and a sixth executable portion that filters and modifies incoming read requests and the read-ahead requests by the storage system based on sequence ID values, the plurality of positions and the sizes of the incoming read requests and read-ahead requests.
 18. The computer program product of claim 17, further including a seventh executable portion that allows for the client and the storage system to communicate in a network.
 19. The computer program product of claim 18, further including an eighth executable portion that performs each of: allowing the client agent to reside locally relative to a respective client of the client agent, and mediating between the client and the storage system by the client agent by communicating with the storage system using a plurality of messages over the network.
 20. The computer program product of claim 19, further including a ninth executable portion that reorders the plurality of messages while the plurality of messages are passing through the network relative to a generation order of the plurality of messages.
 21. The computer program product of claim 17, further including a seventh executable portion that performs one of: maintaining an order relation among the sequence ID values, and overlapping data positions and sizes of the read-ahead requests generated by the client agent.
 22. The computer program product of claim 21, further including an eighth executable portion that generates the sequence ID values by the client agent for each one of a plurality of client read sessions, wherein the sequence ID values generated for each one of the plurality of client read sessions are unique and each of the read requests and the read-ahead requests of a session are assigned the sequence ID value of a respective session.
 23. The computer program product of claim 22, further including a ninth executable portion that maintains, for each one of a plurality of client read sessions by the storage system, a current farthest offset the storage system has processed in the data segment being read and a current sequence ID value.
 24. The computer program product of claim 23, further including a tenth executable portion that processes by the storage system the incoming read requests received from a client agent by performing one of: if the sequence ID value of a read request equals a maintained sequence ID value: discarding the read request if an end offset of the read request is one of smaller than and equal to the current farthest offset, and modifying the current farthest offset to be the end offset of the read request and calculating a data range to read and send to the client agent as the data range starting from a previous value of the current farthest offset plus one byte and ending at a new value of the current farthest offset if the end offset of the read request is larger than the current farthest offset, if one of the sequence ID values of the read request is larger than the maintained sequence ID value, and no previous sequence ID value of a current session exists: setting the maintained sequence ID value to be a value sent with an incoming read request and setting the current farthest offset to be the end offset of the incoming read request and continuing to process the read request without making any change to a range of the read request, and if the sequence ID value of the read request is smaller than the maintained sequence ID value: discarding the read request and the sequence ID value of the read request. 